On Kruskal’s theorem that every 3 × 3 × 3 array has rank at most 5
نویسندگان
چکیده
منابع مشابه
On Clifford’s Theorem for Rank-3 Bundles
In this paper we obtain bounds on h(E) where E is a semistable bundle of rank 3 over a smooth irreducible projective curve X of genus g ≥ 2 defined over an algebraically closed field of characteristic 0. These bounds are expressed in terms of the degrees of stability s1(E), s2(E). We show also that in some cases the bounds are best possible. These results extend recent work of J. Cilleruelo and...
متن کاملTree 3-spanners of diameter at most 5
A subgraph T of a graph G is a tree t-spanner of G if and only if T is a tree and for every pair of vertices in G their distance in T is at most t times their distance in G, where t is called a stretch factor of T . An efficient algorithm to determine whether a graph admits a tree 2-spanner has been developed, while for each t ≥ 4 the problem to determine whether a graph admits a tree t-spanner...
متن کاملOn the Rank of 3× 3× 3 -tensors
Let U , V andW be finite dimensional vector spaces over the same field. The rank of a tensor τ in U ⊗ V ⊗W is the minimum dimension of a subspace of U ⊗V ⊗W containing τ and spanned by fundamental tensors, i.e. tensors of the form u⊗v⊗w for some u in U , v in V and w inW . We prove that if U , V and W have dimension three, then the rank of a tensor in U ⊗ V ⊗W is at most six, and such a bound c...
متن کاملEvery Triangulated 3-Polytope of Minimum Degree 4 has a 4-Path of Weight at Most 27
By δ and wk denote the minimum degree and minimum degree-sum (weight) of a k-vertex path in a given graph, respectively. For every 3-polytope, w2 6 13 (Kotzig, 1955) and w3 6 21 (Ando, Iwasaki, Kaneko, 1993), where both bounds are sharp. For every 3-polytope with δ > 4, we have sharp bounds w2 6 11 (Lebesgue, 1940) and w3 6 17 (Borodin, 1997). Madaras (2000) proved that every triangulated 3-pol...
متن کاملEvery longest circuit of a 3-connected, K3, 3-minor free graph has a chord
Carsten Thomassen conjectured that every longest circuit in a 3-connected graph has a chord. We prove the conjecture for graphs having no K3,3 minor, and consequently for planar graphs. Carsten Thomassen made the following conjecture [1, 7]: Conjecture 1 (Thomassen) Every longest circuit of a 3-connected graph has a chord. That conjecture has been proved for planar graphs with minimum degree at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.03.021